Integer programming for minimal perturbation problems in university course timetabling
نویسندگان
چکیده
منابع مشابه
Integer programming for minimal perturbation problems in university course timetabling
In this paper we present a general integer programming-based approach for the minimal perturbation problem (MPP) in university course timetabling. This problem arises when an existing timetable contains hard constraint violations, or infeasibilities, which need to be resolved. The objective is to resolve these infeasibilities while minimising the disruption or perturbation to the remainder of t...
متن کاملMinimal Perturbation Problem in Course Timetabling
Many real-life problems are dynamic, with changes in the problem definition occurring after a solution to the initial formulation has been reached. The minimal perturbation problem incorporates these changes, along with the initial solution, as a new problem whose solution must be as close as possible to the solution of an initial problem. A new iterative forward search algorithm is proposed to...
متن کاملGenetic Algorithms for University Course Timetabling Problems
The university course timetabling problem is a difficult optimisation problem due to its highly-constrained nature. Finding an optimal, or even a high quality, timetable is a challenging task, especially when resources (e.g., rooms and time slots) are limited. In the literature, many approaches have been studied to solve this problem. In this thesis, we investigate genetic algorithms to solve t...
متن کاملNew integer linear programming approaches for course timetabling
The most complete form of academic timetabling problem is the population and course timetabling problem. In this problem, there may be multiple classes of each subject, and the decision on which students are to constitute each class is made in concert with the decision on the timetable for each class. In order to solve this problem, it is normally simplified or decomposed in some fashion. One s...
متن کاملHybridizing Meta-heuristics Approaches for Solving University Course Timetabling Problems
In this paper we have presented a combination of two metaheuristics, namely great deluge and tabu search, for solving the university course timetabling problem. This problem occurs during the assignment of a set of courses to specific timeslots and rooms within a working week and subject to a variety of hard and soft constraints. Essentially a set of hard constraints must be satisfied in order ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2016
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-015-2094-z